Diminimal families of arbitrary diameter

نویسندگان

چکیده

Given a tree T, let q(T) be the minimum number of distinct eigenvalues in symmetric matrix whose underlying graph is T. It well known that q(T)≥d(T)+1, where d(T) diameter and T said to diminimal if q(T)=d(T)+1. In this paper, we present families trees any fixed diameter. Our proof constructive, allowing us compute, for d these families, M with spectrum has exactly d+1 eigenvalues.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Large circulant graphs of fixed diameter and arbitrary degree

We consider the degree-diameter problem for undirected and directed circulant graphs. To date, attempts to generate families of large circulant graphs of arbitrary degree for a given diameter have concentrated mainly on the diameter 2 case. We present a direct product construction yielding improved bounds for small diameters and introduce a new general technique for “stitching” together circula...

متن کامل

Determination of Large Families and Diameter of Equiseparable Trees

We consider the problem of determining all the members of an arbitrary family of equiseparable trees. We introduce the concept of saturation (based on the number partitions). After that, we use the same concept to obtain the least upper bound for the difference in the diameters of two equiseparable trees with m edges. We prove that this bound is equal to (m−4)/3, where m is the size of trees.

متن کامل

Connected Layer Families and Diameter of Polyhedra Semester Project

Given a polyhedron, its diameter is defined as the maximum distance between two of its vertices, where the distance between two vertices u and v is the number of edges contained in the shortest u− v path in the skeleton of the polyhedron. Bounding the diameter of a polyhedron with respect to its dimension d and the number n of its facets is one of the most important open problems in convex geom...

متن کامل

Families of cut-graphs for bordered meshes with arbitrary genus

Given a triangulated surface M with arbitrary genus, the set of its cut-graphs depends on the underlying topology and the selection of a specific one should be guided by the surface geometry and targeted applications. Most of the previous work on this topic uses mesh traversal techniques for the evaluation of the geodesic metric, and therefore the cut-graphs are influenced by the mesh connectiv...

متن کامل

On Finding Predictors for Arbitrary Families of Processes

The problem is sequence prediction in the following setting. A sequence x1, . . . , xn, . . . of discrete-valued observations is generated according to some unknown probabilistic law (measure) μ. After observing each outcome, it is required to give the conditional probabilities of the next observation. The measure μ belongs to an arbitrary but known class C of stochastic process measures. We ar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2023

ISSN: ['1873-1856', '0024-3795']

DOI: https://doi.org/10.1016/j.laa.2023.07.018